Randomized Pursuit-Evasion with Local Visibility
نویسندگان
چکیده
منابع مشابه
Randomized Pursuit-Evasion with Local Visibility
We study the following pursuit-evasion game: One or more hunters are seeking to capture an evading rabbit on a graph. At each round, the rabbit tries to gather information about the location of the hunters but it can see them only if they are located on adjacent nodes. We show that two hunters suffice for catching rabbits with such local visibility with high probability. We distinguish between ...
متن کاملVisibility-Based Pursuit-Evasion with Bounded Speed
This paper presents an algorithm for a visibility-based pursuit-evasion problem in which bounds on the speeds of the pursuer and evader are given. The pursuer tries to find the evader inside of a simply-connected polygonal environment, and the evader in turn tries actively to avoid detection. The algorithm is at least as powerful as the complete algorithm for the unbounded speed case, and with ...
متن کاملA Visibility-Based Pursuit-Evasion Problem
This paper addresses the problem of planning the motion of one or more pursuers in a polygonal environment to eventually \see" an evader that is unpredictable, has unknown initial position, and is capable of moving arbitrarily fast. A visibility region is associated with each pursuer, and the goal is to guarantee that the evader will ultimately lie in at least one visibility region. The study o...
متن کاملVisibility Induction for Discretized Pursuit-Evasion Games
We study a two-player pursuit-evasion game, in which an agent moving amongst obstacles is to be maintained within “sight” of a pursuing robot. Using a discretization of the environment, our main contribution is to design an efficient algorithm that decides, given initial positions of both pursuer and evader, if the evader can take any moving strategy to go out of sight of the pursuer at any tim...
متن کاملVisibility-Based Pursuit-Evasion in the Plane
The speed at which robots begin to enter various application domains is now largely dependent on the availability of robust and efficient algorithms that are capable of solving the complex planning problems inherent to the given domain. This talk will present a line of research that makes progress towards solving some of the complex planning problems found in target tracking applications where ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2006
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480104442169